Journal of the Iranian Statistical Society

Keyword Index

A

  • Analysis of algorithms Periodic Oscillations in the Analysis of Algorithms and Their Cancellations [Volume 3, Issue 2, 2004, Pages 251-270]
  • Analysis of algorithms QUICKSELECT Revisited [Volume 3, Issue 2, 2004, Pages 271-296]
  • Asymptotic analysis On the Average Height of b-Balanced Ordered Trees [Volume 3, Issue 2, 2004, Pages 175-218]

B

  • Bayes\' law‎ When Can Finite Testing Ensure Infinite Trustworthiness? [Volume 3, Issue 1, 2004, Pages 1-37]
  • Binary search tree Connecting Yule Process, Bisection and Binary Search Tree via Martingales [Volume 3, Issue 2, 2004, Pages 89-116]
  • Binary search tree Profile and Height of Random Binary Search Trees [Volume 3, Issue 2, 2004, Pages 117-138]

C

  • Car parking One-Sided Interval Trees [Volume 3, Issue 2, 2004, Pages 149-164]
  • Conditional test‎ A Conditional Test for Exponentiality Against Weibull DFR Alternatives Based on Censored‎ ‎Samples [Volume 3, Issue 1, 2004, Pages 69-81]
  • Cycles Measuring Post–Quickselect Disorder [Volume 3, Issue 2, 2004, Pages 219-249]

D

  • Dedekind’s eta function Periodic Oscillations in the Analysis of Algorithms and Their Cancellations [Volume 3, Issue 2, 2004, Pages 251-270]
  • Digital trees Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth [Volume 3, Issue 2, 2004, Pages 139-148]
  • Disorder Measuring Post–Quickselect Disorder [Volume 3, Issue 2, 2004, Pages 219-249]

E

  • Empirical process of U-statistic structure Moment Inequalities for Supremum of Empirical Processes of‎ ‎U-Statistic Structure and Application to Density Estimation [Volume 3, Issue 1, 2004, Pages 59-68]
  • Estimability‎ Parameter Identifiability Issues in a‎ ‎Latent Ma‎- ‎rkov Model for Misclassified Binary Responses [Volume 3, Issue 1, 2004, Pages 39-57]

F

  • FIND QUICKSELECT Revisited [Volume 3, Issue 2, 2004, Pages 271-296]
  • FIND process QUICKSELECT Revisited [Volume 3, Issue 2, 2004, Pages 271-296]

G

  • Grand PGF Probability Generating Functions for Sattolo’s Algorithm [Volume 3, Issue 2, 2004, Pages 297-308]

H

  • Height Profile and Height of Random Binary Search Trees [Volume 3, Issue 2, 2004, Pages 117-138]

I

  • Inversions Measuring Post–Quickselect Disorder [Volume 3, Issue 2, 2004, Pages 219-249]

M

  • Mellin transform Periodic Oscillations in the Analysis of Algorithms and Their Cancellations [Volume 3, Issue 2, 2004, Pages 251-270]

P

  • Patricia trie Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth [Volume 3, Issue 2, 2004, Pages 139-148]
  • Profile Profile and Height of Random Binary Search Trees [Volume 3, Issue 2, 2004, Pages 117-138]

R

  • Random structure P´olya-Type Urn Models with Multiple Drawings [Volume 3, Issue 2, 2004, Pages 165-173]

U

  • Urn model P´olya-Type Urn Models with Multiple Drawings [Volume 3, Issue 2, 2004, Pages 165-173]

Y

  • Yule process Connecting Yule Process, Bisection and Binary Search Tree via Martingales [Volume 3, Issue 2, 2004, Pages 89-116]